Quadrature rules from finite orthogonality relations for Bernstein-Szegö polynomials

Fast simplicial quadrature-based finite element operators using Bernstein polynomials

We derive low-complexity matrix-free finite element algorithms for simplicial Bernstein polynomials on simplices. Our techniques, based on a sparse representation of differentiation and special block structure in the matrices evaluating B-form polynomials at warped Gauss points, apply to variable coefficient problems as well as constant coefficient ones, thus extending our results in [14].

Orthogonality Relations for Multivariate Krawtchouk Polynomials

The orthogonality relations of multivariate Krawtchouk polynomials are discussed. In case of two variables, the necessary and sufficient conditions of orthogonality is given by Grünbaum and Rahman in [SIGMA 6 (2010), 090, 12 pages]. In this study, a simple proof of the necessary and sufficient condition of orthogonality is given for a general case.

Quadrature Rules for Fuzzy Integrals

Weighted Quadrature Rules for Finite Element Methods

We discuss the numerical integration of polynomials times exponential weighting functions arising from multiscale finite element computations. The new rules are more accurate than standard quadratures and are better suited to existing codes than formulas computed by symbolic integration. We test our approach in a multiscale finite element method for the 2D reaction-diffusion equation. Standard ...

Szegö on Jacobi Polynomials

One of the interesting features in the development of analysis in the twentieth century is the remarkable growth, in various directions, of the theory of orthogonal functions. Two brilliant achievements on the threshold of this century—Fejér's paper on Fourier series and Fredholm's papers on integral equations—have been acting as a powerful inspiring source of attraction, inviting analysts to d...